Corner sharpening using look-up table edge pixel identification

ABSTRACT

The teachings provided herein disclose a method for corner sharpening in the display of a bitmapped digital image. The method includes the steps of selecting a target pixel location within the digital image; observing a set of pixels within a pixel observation window superimposed on the digital image relative to the target pixel location; generating edge-state codes for a plurality of pairs of neighboring vectors of pixels within the pixel observation window; generating corner-identification codes from the plurality of edge-state codes using at least one look-up table so as to thereby identify corner pixels; and, assigning a pixel value in an output image plane in a location corresponding to the target pixel in the input image, such that assigned value extends a corner where indicated by a corner identification code, thereby producing a sharpening effect. The method may be used for improving the print quality of line-art corners and other fine details as found in both font and image data.

CROSS-REFERENCE TO COPENDING APPLICATIONS

Attention is directed to copending applications filed concurrently herewith: U.S. Application Publication No. 2007/0146386 A1, now U.S. Pat. No. 7,518,618, entitled “ANTI-ALIASED TAGGING USING LOOK-UP TABLE EDGE PIXEL IDENTIFICATION”; U.S. Application Publication No. 2007/0147684 A1, entitled “EDGE PIXEL IDENTIFICATION”; and U.S. Application Publication No. 2007/0146796 A1, entitled “TINTED EDGE ENHANCEMENT USING LOOK-UP TABLE EDGE PIXEL IDENTIFICATION”. The disclosure found in each of these copending application is hereby incorporated by reference in its entirety.

CROSS-REFERENCE TO RELATED APPLICATIONS

Cross reference is made to the following applications, the disclosures of each of which are totally incorporated by reference herein: US Publication No. 2005/0129328, entitled “CORNER SHARPENING OF TEXT AND LINE ART IN A SUPER RESOLUTION ANTI-ALIASING IMAGE PATH,” to inventors E. Saber, R. Loce, filed Dec. 15, 2003; and U.S. application Ser. No. 10/973,725, entitled “TINTED EDGE ENHANCEMENT USING HARMONIC HALFTONES FOR THE BOUNDARY PIXELS”, to inventors C. Purdum, R. Loce, B. Xu, D. Lieberman, M. Gwaltney, J. McEvain, C. Hains, filed Oct. 26, 2004. The appropriate components and processes of the above co-pending application may be selected for the invention of the present application in embodiments thereof.

BACKGROUND AND SUMMARY

The present disclosure relates to a methodology for improving the print quality of line-art corners and other fine details as found in both font and image data. More specifically, this disclosure relates to corner sharpening via look-up table based edge detection in digital image processing.

In the printing arts, sharpening of corners has been found to be desirable due to the fact that because marking and imaging processes can round off corners and make font serifs short and blunt. Further, it may be desirable to sharpen such features due to human observer appearance preferences. In the printing arts, this problem was typically overcome by manual image customization by hand of any troublesome detail areas. This was particularly the case with fonts or reusable type. For example, ink traps would be added to those areas in a font character where too much ink would otherwise collect and cause smearing. Similarly, detail areas would be sharpened to insure the desired print result.

This approach of compensating to get a desired result such as sharpening has followed-on from the print arts into the digital imaging arts. As an example, Digital Typography: An Introduction to Type and Composition for Computer System Design, by Richard Rubinstein, discusses the desirability of compensating for electrostatic effects which result in toner not being placed on the paper exactly as the bit image specifies. Compensation is depicted there as adding to the image bit map to sharpen convex (outside) corners which would otherwise get rounded over. An alternative compensation is also depicted for handling situations involving concave (inside) corners by removing black printing pixels from the corner region of a shape to make an ink trap. In FIG. 9 there is depicted the bit image data and thereby the desired print image. In FIG. 10 is depicted the rounded-over result when printed on a given printer. FIG. 11 shows the bit image compensation which when printed will yield the desired result as depicted in FIG. 9 above. Note the ears 2000 added to the outside corners and the ink trap 2010 added to address the inside corner. The above figures and discussion are further developed in U.S. Patent Publication No. 2005/0129328 entitled “CORNER SHARPENING OF TEXT AND LINE ART IN A SUPER RESOLUTION ANTI-ALIASING IMAGE PATH” to inventors Eli S. Saber, and Robert P. Loce, which is herein incorporated by reference in its entirety for its teachings.

An edge within an image is a sharp change in local intensity or lightness. In other words, edges are features within an image that possess strong intensity contrast. Edges occur between distinct objects in a scene, or within textures and structures within an object. For instance, typographic characters on a white page background produce distinct edges. Edge pixels in a digital image are those pixels that occur at and about an edge in the image.

Two key properties of an edge are strength and orientation. Edge strength is a measure of the contrast of an edge. A black typographic character on a white background produces stronger edges than a gray character on a white background. Edge orientation can be described by a variety of measures, such as angle quantified in degrees or by classes such as vertical, horizontal, and diagonal.

Other attributes of edges are also useful to image analysis and image processing. For instance, classification of combined edges, such as corners, has been used in object recognition and in image enhancement applications. Edge thickness is a measure that provides information on the breadth of a local contrast change and can indicate a degree of blur in an image, see for example: U.S. Pat. No. 6,763,141, entitled “ESTIMATION OF LOCAL DEFOCUS DISTANCE AND GEOMETRIC DISTORTION BASED ON SCANNED IMAGE FEATURES,” to inventors B. Xu, R. Loce, which is hereby incorporated in its entirety for its teachings. Inner edges and outer edges refer to regions just inside of or just outside of a given object, respectively, and have been used in applications such as character stroke thinning and thickening. The presence or absence of an edge is an edge-related property that has been used in applications such as image classification and recognition. Distance from an edge is also an edge-related property that has been used in image enhancement applications.

Edge detection in digital image processing typically employs a collection of methods used to identify or modify edge pixels or indicate properties of edges and edge pixels within an image. Edge detection methods are sometimes referred to simply as edge detectors. There are numerous applications of edge detectors in digital image processing for electronic printing. For example, identification of corner pixels has been used to sharpen corners within an image, see: U.S. Pat. No. 6,775,410, entitled “IMAGE PROCESSING METHOD FOR SHARPENING CORNERS OF TEXT AND LINE ART,” to inventors R. Loce, X. Zhu, C. Cuciurean-Zapan. Identification of inner and outer border pixels has been used to control the apparent darkness of character strokes, see: U.S. Pat. No. 6,606,420, entitled “METHOD AND APPARATUS FOR DIGITAL IMAGE DARKNESS CONTROL IN SATURATED IMAGE STRUCTURES”, to Loce et al; and U.S. Pat. No. 6,181,438, entitled “METHOD AND APPARATUS FOR DIGITAL IMAGE DARKNESS CONTROL USING QUANTIZED FRACTIONAL PIXELS,” to Bracco et al. Also identification of anti-aliased pixels has been used for preferred rendering of those same pixels, see: U.S. Pat. No. 6,243,499, entitled “TAGGING OF ANTIALIASED IMAGES,” to Loce, et al.; U.S. Pat. No. 6,144,461, entitled “METHOD FOR GENERATING RENDERING TAGS TO FACILITATE THE PRINTING OF ANTIALIASED IMAGES,” to Crean, et al.; and U.S. Pat. No. 6,167,166, entitled “METHOD TO ENABLE THE RECOGNITION AND RENDERING OF ANTIALIASED IMAGES,” to Loce et al. All of the above cited are hereby incorporated by reference in their entirety for their teachings.

Edge detectors typically operate using a convolution mask and are based on differential operations. Differentials for edge/line detection are used to define color or brightness changes of pixels and their change directions. If there is an abrupt change of brightness within a short interval within an image, it means that within that interval there is high probability that an edge exists. One example of a convolution-based edge detector is the Roberts edge detector, which employs the square root of the magnitude squared of the convolution with the Robert's row and column edge detectors. The Prewitt edge detector employs the Prewitt compass gradient filters and returns the result for the largest filter response. The Sobel edge detector operates using convolutions with row and column edge gradient masks. The Marr-Hildreth edge detector performs two convolutions with a Laplacian of Gaussians and then detects zero crossings. The Kirsch edge detector performs convolution with eight masks that calculate gradient.

As indicated above, common edge detection methods employ a convolution-type computing architecture, usually with fixed coefficients. In the field of image processing, and in particular, for image processing in anticipation of electronic printing, the edge detection needs are numerous and varied. Further, image processing for electronic printing often requires that any processing method operates “real-time,” within a small number of fixed clock cycles, thereby excluding more complicated methods as too computationally intensive.

What is needed is a technique which will solve the problem of corner rounding as an automated, non-manual processing operation with a computing architecture that is more readily adapted to a wide variety of corner detection needs than are the common convolution-based methods, and which can be readily adapted to real-time applications.

Disclosed in embodiments herein is a method for corner sharpening in the display of a bitmapped digital image. The method comprises selecting a target pixel location within the digital image; observing a set of pixels within a pixel observation window superimposed on the digital image relative to the target pixel location; generating edge-state codes for a plurality of pairs of neighboring vectors of pixels within the pixel observation window; generating corner-identification codes from the plurality of edge-state codes using at least one look-up table so as to thereby identify corner pixels; and assigning a pixel value in an output image plane in a location corresponding to the target pixel in the input image, such that that assigned value extends a corner where indicated by a corner identification code, thereby producing a sharpening effect.

Further disclosed in embodiments herein is a method for producing corner sharpened image data from binary digital image data. The method comprises observing a set of pixels about a target pixel within a pixel observation window superimposed on the binary digital image relative to the target pixel location; generating sums of weighted pixel values, where the sums are taken over at least first-orientation vectors and second-orientation vectors of pixels that run through the observation window; generating sum-to-sum differences for neighboring pairs of said first-orientation vectors of pixels and second-orientation vectors of pixels; generating edge-state codes for each pair of the neighboring first-orientation vectors of pixels and second-orientation vectors of pixels by using one or more bits to encode a magnitude and one bit to encode a sign; generating a first-orientation edge identification code and second-orientation edge identification code by using a plurality of said respectively oriented encoded edge-state codes, where the bits of the edge-state codes are combined to form an index that addresses a respective orientation look-up table that maps multiple encoded edge states to a respective orientation edge identification code; generating an overall corner identification code by using edge identification codes for the at least two orientations of vectors, wherein the bits that form the corner identification codes for the at least two orientations of vectors are combined to form an index that is used to address an overall corner identification look-up table; and, assigning a pixel value in an output image plane in a location corresponding to the target pixel in the input image, such that that assigned value extends a corner where indicated by a corner identification code, thereby producing a sharpening effect.

Further disclosed in embodiments herein is a method for producing corner sharpened image data from continuous tone digital image data. The method comprises selecting a target pixel location within the continuous tone image; observing a set of pixels within a pixel observation window superimposed on the continuous tone image relative to the target pixel location; generating edge-state codes for a plurality of pairs of neighboring vectors of pixels within the pixel observation window; generating a corner-identification code from the plurality of edge-state codes using at least one look-up table so as to thereby identify corner pixels; and, assigning a pixel value in an output image plane in a location corresponding to the target pixel in the input image, such that that assigned value extends a corner where indicated by a corner identification code, thereby producing a sharpening effect.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a general representation of a suitable system-level embodiment for one or more aspects of the teachings presented herein.

FIG. 2 depicts a flow chart of an image processing system containing an embodiment of the teachings presented herein.

FIG. 3 schematically depicts an embodiment of an observation window.

FIG. 4 is a generalized data flow representation of one embodiment of the teachings presented herein.

FIG. 5 is a generalized data flow representation of another embodiment of the teachings presented herein.

FIG. 6 depicts a schematic of an embodiment of the computing architecture of an embodiment of the teachings presented herein.

FIG. 7 shows an exemplary input digital image possessing edges and an array of output edge identification codes according to the teachings presented herein.

FIG. 8 shows sharpened and unsharpened bitmaps and their printed appearance.

FIGS. 9, 10, and 11 depict prior art for corner sharpening.

DETAILED DESCRIPTION

It is to be understood that the disclosure of embodiments following describe a digital data technique which sharpens the corners of image data to compensate for corner rounding. It is desirable to perform such compensation because marking and imaging processes can round off corners and make font serifs short and blunt. Further, it may be desirable to sharpen such features due to human observer appearance preferences. For a general understanding of the present disclosure, reference is made to the drawings. In the drawings, like reference numerals have been used throughout to designate identical elements. In describing the present disclosure, the following term(s) have been used in the description.

The term “data” refers herein to physical signals that indicate or include information. An “image”, as a pattern of physical light or a collection of data representing said physical light, may include characters, words, and text as well as other features such as graphics. A “digital image” is by extension an image represented by a collection of digital data. An image may be divided into “segments”, each of which is itself an image. A segment of an image may be of any size up to and including the whole image. The term “image object” or “object” as used herein is considered in the art to be generally equivalent to the term “segment” and will be employed herein interchangeably.

In a digital image composed of data representing physical light, each element of data may be called a “pixel”, which is common usage in the art and refers to a picture element. Each pixel has a location and value. Each pixel value is a bit in a “binary form” of an image, a gray scale value in a “gray scale form” of an image, or a set of color space coordinates in a “color coordinate form” of an image, the binary form, gray scale form, and color coordinate form each being a two-dimensional array defining an image. Although described herein as binary or continuous tone processing, the present invention applies equally as well to the processing of color images, wherein each separation is treated, effectively, as a gray scale or continuous tone image. Accordingly, references herein to the processing of continuous tone (contone) or gray scale images is intended to include the processing of color image separations as well. An operation performs “image processing” when it operates on an item of data that relates to part of an image.

A “high addressability pixel” can be a pixel comprising a plurality of high addressability pixel events, where, for example, each of the high addressability pixel events corresponds to a specific spatial placement of the writing spot with respect to the pixel and has a value that represents a property of the writing spot at that specific spatial placement. In binary high addressability pixels, for example, each high addressability pixel event is a single bit indicating whether the writing spot is “on” or “off” at the corresponding spatial placement. In general, high addressability, as used above, refers to a pixel grid where the spatial sampling of the grid is higher in one dimension than in the other dimension.

High addressability also commonly refers to an imaging method where the imaging device can position the writing spot with precision finer than the size of the writing spot. For instance, a typical spot per inch (spi) high addressability system may operate with a 40 micron writing spot, an addressability of 600/inch in the direction perpendicular to the raster lines, and an addressability of 4800/inch in the direction of the raster lines.

High addressability also refers to writing an image with a higher sampling resolution than is input to the writing system. Similarly, high addressability also refers to a pixel sampling resolution that is higher than the input resolution in at least one dimension. For example, an input resolution of 300 spi may be converted to 600 spi and that resolution conversion is referred to as high addressability.

Systems that write high addressability images typically regulate a laser or similar writing device using clock modulation, amplitude modulation, pulse width modulation, pulse width position modulation or equivalent procedures. Imaging devices other than laser scanners can also employ high addressability. For instance, ink jet devices can have drop ejection rates that yield drop placements at high addressability and LED image bars can clock the LED “on” events at rates that are high relative to the spot size and diode spacing.

“Anti-aliasing” (AA) in the context of digitizing line art and certain graphical image structures is best known as a method of using intermediate levels of intensity to achieve subpixel position of edges for several reasons including reduction or elimination of jaggies on the edges of lines and polygons, including text. Jaggies are primarily visible at the edges of sloped lines approaching horizontal or vertical. The term anti-aliasing suggests an analog term aliasing; normally representing the presence of low frequencies resulting from sampling high frequency signals at too low a sampling rate. Anti-aliased images can be generated by capturing the image at a resolution greater than the final or desired output resolution, then reducing the resolution of the image by sub-sampling using an averaging process. A major benefit of anti-aliased images is that high contrast, saturated objects are surrounded with pixels possessing intermediate values that visually suggest the true, higher resolution position of object edges.

“Corner sharpening” refers to substituting pixel values in pixel locations that are identified near a corner, to achieve clustering of the substituted pixel values about corner in a manner that produces a sharper appearance upon viewing. Corner sharpening may be necessary to compensate for rounding caused by physical printing or display processes.

Turning now to FIG. 1, depicted therein is an embodiment of a digital imaging system suitable for one or more aspects of the present invention. In the system 110, image source 120 is used to generate image data that is supplied to an image processing system 130, and which produces output data for rendering by print engine 140. Image source 120 may include scanner 122, computer 124, network 126 or any similar or equivalent image input terminal. On the output end printer engine 140 is preferably a xerographic engine however print engine 140 may include such equivalent print technology alternatives as wax, ink jet, etc. The teachings presented herein are directed toward aspects of image processor 130 depicted in FIG. 1. In particular, the intention of the teachings presented herein is to identify, and process accordingly, corner pixels within a digital image. It will be appreciated by those skilled in the art that the rendering of an image into a printable or displayable output format may be accomplished at any of a number of locations, which herein is provided for in but one example only as occurring within the image processing system 130 or within in the print engine 140.

Referring now to FIG. 2, shown therein is a diagram depicting the data flow in an example embodiment. Image processing system 130 receives raw (unprocessed) image input image data 200. Image processing system 130 includes an edge identification processor 210, and may contain other image processing operations as well. Within the edge identification processor 210 a target pixel selection step 220 is used to select a target pixel and an observation window of pixels is located about the target pixel 230. In one embodiment, this window is 5×5 pixels in dimension with the center pixel as the window origin, where the origin pixel is used to locate the window on the target pixel. However, a smaller widow such as a 3×3, or in the alternative a larger size window, or even a window of a non-square shape, is well within the contemplation of the present disclosure. This window is stepped through the image pixel data. In one embodiment the origin pixel is stepped to target pixels from top to bottom and from left to right through all address locations within an image. Typically all pixels within the input image become target pixels in a successive manner. At each location the pixel values are extracted from within the window as indicated in step 240.

FIG. 3 depicts a 5×5 window 300 with a center pixel 310 as the window origin (p₂₂), which is used in locating the window 300 about a given target pixel. The pixel values in the window are each denoted by some p_(ij), where the subscripts i and j denote row and column indices respectively, and range from 0 to 4 for the 5×5 window. A circle 311 has been added as a quick visual indicator of the origin pixel location within the window. It is this origin pixel 310 which is typically stepped across all pixel address locations as each pixel location in turn becomes a target pixel. For each target pixel address, the pixel values within the window 300 are applied to the edge identification processing as described above and below in the discussion of FIG. 2. While the discussion here of FIGS. 2 and 3 describes the edge identification process as a serial operation, where successive target pixels are defined and processed, it will also be recognized by one skilled in the art that a parallel process could be employed where multiple target pixels could be processed simultaneously using multiple windows and multiple edge identification processors. The bitmap image data may be divided-up in any number of ways in order to achieve this parallel processing of the image data. One approach for example would be using segmentation to divide the image data into text and graphics. Another approach for color images would be to separate out the color planes and process each individually. There are many other approaches that will be apparent to those skilled in the art.

Returning now to FIG. 2, in step 250 the extracted pixel values are used as input into the edge identification processing means 210. There are alternative computing architectures that may be employed here, such as parallel, serial, or some combination of parallel and serial operations, as will be evident to those skilled in the art. However the computing architecture is configured, the operations are low complexity arithmetic and look-up table operations applied to the extracted pixel values. The edge identification performed in step 250 is encoded to a corner identification code in step 260. The corner identification code may used in step 265 to modify a pixel about a corner within the image data to produce image data with modified corner pixels. Finally, the increment block 270 restarts the process loop over at the next target pixel address until all target pixels have been processed.

FIG. 4 depicts a flowchart wherein a digital image data 200 is input to corner sharpening process 400. A target pixel is selected and an observation window of pixels is observed about the target pixel 420. Edge-state codes are generated for a plurality of pairs of vectors of pixels that run through the observation window 430. FIG. 3 depicts one arrangement of vectors of pixels that run through the observation window in horizontal 320 and vertical 330 orientations. Vectors of other orientation, such as diagonal, may be employed in generating edge-state codes. A corner-identification code is generated from the plurality of edge state codes 440 to produce a corner-identification code about the target pixel. The corner-identification code is used in corner sharpening step 445 to produce an output digital image pixel where that pixel value may introduce sharpening of a corner in an output image composed of pixels processed using the corner sharpening process 400.

Consider a contone image example where the foreground of a saturated (fully “on”) typographic character is represented by pixels of value 255 and background pixels are represented by pixels of value 0. A target pixel located in the background near an outside corner may be assigned a value 255, or some value greater than 0, thereby increasing its value over the value of the target pixel and extending the corner outward and producing a sharpening effect. Conversely, if a target pixel is located in the foreground of a typographic character, and is near an inside corner, the output pixel may be assigned a value of 0 or some value less than 255, thereby decreasing its value over the value of the target pixel and extending the corner inward and producing a sharpening effect.

A contone image may be anti-aliased or contain gray features, such that the edge of typographic characters, graphics and forms of line art possess gray edges. The present teachings apply to this class of image in a manner similar to a conventional contone image with the difference being that the assigned pixel values will be increased or decreased from the value of the target pixel, which is intermediate to 0 to 255.

Consider the case where the output pixel is composed of high addressable pixels, some number of the high addressable pixels may be used to extend a corner. For instance, a target pixel within an input image located in the background of a typographic character near an outside corner will possess a value of 0. An output pixel would extend the corner if some fraction of the high addressable pixels is assigned an “on” value, i.e., 1. Considering a 4× high addressable pixel example, high addressable pixel values of 0011 would extend the corner, thereby producing a sharpening effect.

If more pixels are to be processed, the corner sharpening process returns to the step of selecting a target pixel and observation window of pixels about the target pixel 420. The output of corner sharpening process 400 is a digital image where corner pixels have been sharpened in location corresponding to target pixel locations in the input image 450.

FIG. 5 depicts how an observation window of pixels 300 about a target pixel 310 is input 510 to step 520 where a plurality of sums of weighted pixel values are generated, where each sum is taken over a vector of pixels that run through the observation window. The weights can be applied as multiplicative coefficients, or another means, such as by an additive or subtractive operation. Step 530 receives the weighted sums of vectors of pixels, and generates vector-sum-to-vector-sum differences between pairs of neighboring vectors. For instance, when employing horizontal vectors 320 for pixel observation window rows 0 through 4, differences can be generated for the respective sums of row 0 and 1, the respective sums of rows 1 and 2, the respective sums of rows 2 and 3, and the respective sums of rows 3 and 4. Alternatively, differences may be taken between neighboring vectors other than the nearest neighboring vectors. For instance, differences can be generated for the respective sums of row 0 and 2, the respective sums of rows 1 and 3, and the respective sums of rows 2 and 4.

The vector-sum-to-vector-sum differences are input to step 540 where an “edge-slope state” between each of the plurality of vector pairs is determined. “Edge-slope state” refers to the presence of an edge and the orientation of the edge (rising or falling) between the vectors of pixels. Large differences between the sums indicate the presence of an edge, while positive and negative signs to the difference indicate a rising or falling edge, respectively. Step 550 receives the plurality of edge-slope states and encodes those states as a plurality of respective bit patterns. For instance, the presence or strength of an edge between two vectors of pixels may be encoded in some number of bits, and the sign, or orientation, of the edge may be encoded by another bit. For applications that do not require high precision definition of edges, it may be sufficient to encode the presence and strength of an edge in 1 bit, i.e., an edge is significantly present or an edge is not significantly present. For other applications requiring finer identification of edges, more than one bit may be used to define the presence and strength of an edge.

The plurality of edge states for the vectors generated in step 550 are input to an encoding process 560 that generates a code for the corner state of the plurality of vectors of the window. In other words, step 560 will receive a plurality of bit patterns, i.e., edge-state codes for the vector differences, and may employ a look-up table to map those bit patterns to a bit pattern representing a corner state for the plurality of vectors examined. For instance, a corner-state code about a target pixel may indicate the position of that target pixel with respect to an inside or outside corner within the pixel observation window. The corner state code is used in corner sharpening step 565 to produce a pixel corresponding to the target pixel location within an output digital image, where that pixel value may produce a sharpening effect if the target pixel was located near a corner.

FIG. 6 depicts a detailed high-level block diagram schematic for one embodiment consistent with the teachings provided herein. An observation window of pixels 300 is shown with the window origin pixel denoted p₂₂. Pixels aligned in a particular orientation are used to form a plurality of vectors of pixels associated with that orientation. In FIG. 6, rows of pixels in the observation window are used to form respective horizontal vectors of pixels 320 and columns of pixels are used to form respective vertical vectors of pixels 330. As will be evident to those skilled in the art, other or additional vectors of pixels of other orientations may be formed from pixels in the observation window. For example, vectors of pixels may be formed from pixels aligned at some angle, such as ±45°.

In the next step, the plurality of vectors of pixels are received and weighted sums of pixels within each vector are generated. FIG. 6 illustrates multiplicative weighting with weights a_(ij) applied to the pixel values within a vector, whereupon the weighted values are summed. These weights a_(ij) can be selected and optimized for particular applications. For instance, in the presence of background noise in the image, the weights may be made uniform (e.g., all 1's) in an attempt to suppress the effect of noise on the edge identification. Conversely, a low noise setting or in situations where images possess very small edge features it may be required to utilize larger values of weights a_(ij) near the center of the window and smaller values at greater distance from the center. The values could decrease from a center value with a trend such as linear or Gaussian. The weighting and summing process is performed for each respective vector of each orientation. Summing blocks 615 in the present embodiment perform the summing process for the horizontal vectors and Summing blocks 620 perform the summing process for the vertical vectors. A plurality of sums are produced, denote by Y_(i) for the horizontal vectors and X_(i) for the vertical vectors, where i=0 to 4 in the presently illustrated embodiment.

In some computing architectures it can be advantageous to reduce the number of bits in the weighting and summing process. For instance, when using 8-bit numbers possessing range 0 to 255, and using multiplicative coefficients defined by 8 bits, the resultant product may require 16-bit representation. A sum over the vector of pixels would require an even higher bit representation. Using such a large number of bits to represent results of these intermediate operations can be very costly for real-time, high-speed applications. Further, typical edge identification tasks do not require such a great bit depth. It has been found that it is advantageous as to both cost and speed to reduce the bit depth of these operations. For instance, the weighted sums can be limited to 8 bits of quantization resolution.

In a subsequent step, the weighted vector sums are received and differences are formed between pairs of sums of neighboring vectors of a particular orientation. In FIG. 6, computational blocks 625 and 630 perform differencing for nearest-neighbor rows and nearest-neighbor columns, respectively, to form a plurality of vector-sum differences for each orientation. In FIG. 6, the differences are denoted as dy_(i) for column vectors and dx_(i) for row vectors, where i=0 to 3. As stated above, the difference step may not be restricted to nearest neighbors, and may be performed between neighboring vectors that are separated by one or more vectors.

In a further step, a plurality of edge-slope states between the vectors are generated using respective differences between vector sums as input. Determination of the edge-slope states depicted in FIG. 6 as performed by computational blocks 635 and 640 tests the magnitude and sign of each difference. For each difference, the significance of the edge is determined by comparing the magnitude of that difference to a threshold. A 1-bit output (states 0 or 1) indicates that the difference is at or above a threshold, thereby indicating significance, or is not at or above the threshold, thereby indicating lack of significance. The thresholds are depicted in FIG. 6 as t_(i) where i=0 to 3. These thresholds may be set over a broad range of value and made the same or different for different vector pairs or different vector orientations depending on a particular application. For instance, thresholds may be set low (e.g., 16) when attempting to identify an edge of a gray object, such as a gray typographic character, and may be set high (e.g., 128) when attempting to identify a high contrast edge, like the corner of a black typographic character on a white background. The sign of each difference is also tested and the result is rendered to a 1-bit form indicating a positive or negative slope, where slope of zero could be classified either positive or negative due to the lack of significance of the edge. The edge-slope states are determined for row and column vectors, by computational blocks 635 and 640, respectively. A plurality of edge-slope states are determined for each orientation.

An edge encoding block for a given particular orientation receives the edge-slope state and generates a code for the edge state of that orientation. In FIG. 6, encoding blocks 645 and 650 provide the encoding of edge states for horizontal and vertical orientations, respectively. The encoding may in one embodiment be performed via a Look-Up Table (LUT) that maps the bits of the plurality of edge-slope states for an orientation to an orientation edge-state code. The FIG. 6 embodiment illustrates the use of an 8-bit-to-4-bit LUT for that encoding purpose, but it is within the scope of the teachings herein to allow other bit mapping relationships. For instance, use of more vectors or high quantization of vector-sum differences could require more than 8 bits as input and 4 bits output. The multiple orientation edge-state codes are mapped through an additional encoding process block 655 to produce corner-state code. This encoding may also be performed using a LUT process. The corner state code is used in corner sharpening step 660 to produce a pixel corresponding to the target pixel location within an output digital image, where that pixel value may produce a sharpening effect if the target pixel was located near a corner.

An example of a LUT for encoding edge states is given in Table 1. The codes are shown in the table as hexadecimal numbers. In Table 1, the notation used is in reference to horizontal vectors, but concepts embodied by the table are more general. For instance, it is straightforward to interpret the inputs to be from an orientation other than horizontal, such as vertical or diagonal. The notation used as state descriptions in Table 1 is explained in Table 2.

TABLE 1 Row Edge Encoding Edge Slope States dY0 > 0 abs(dY0) > T dY1 > 0 abs(dY1) > T dY2 > 0 abs(dY2) > T dY3 > 0 abs(dY3) > T 1 means 1 means 1 means 1 means 1 means 1 means 1 means 1 means falling strong falling strong falling strong falling strong Edge State Edge State edge edge edge edge edge edge edge edge Description Code 0 0 0 0 0 0 0 0 Flat 0x0E 0 0 0 0 0 0 0 1 ↑FB 0x00 0 0 0 0 0 0 1 0 Flat 0x0E 0 0 0 0 0 0 1 1 ↓FB 0x01 0 0 0 0 0 1 0 0 ↑B 0x04 0 0 0 0 0 1 0 1 ↑B↑FB 0x02 0 0 0 0 0 1 1 0 ↑B 0x04 0 0 0 0 0 1 1 1 ↑B↓FB 0x0F 0 0 0 0 1 0 0 0 Flat 0x0E 0 0 0 0 1 0 0 1 ↑FB 0x00 0 0 0 0 1 0 1 0 Flat 0x0E 0 0 0 0 1 0 1 1 ↓FB 0x01 0 0 0 0 1 1 0 0 ↓B 0x05 0 0 0 0 1 1 0 1 ↓B↑FB 0x0F 0 0 0 0 1 1 1 0 ↓B 0x05 0 0 0 0 1 1 1 1 ↓B↓FB 0x03 0 0 0 1 0 0 0 0 ↑T 0x08 0 0 0 1 0 0 0 1 ↑T↑FB 0x0F 0 0 0 1 0 0 1 0 ↑T 0x08 0 0 0 1 0 0 1 1 ↑T↓FB 0x0F 0 0 0 1 0 1 0 0 ↑T↑B 0x06 0 0 0 1 0 1 0 1 ↑T↑B↑FB 0x0F 0 0 0 1 0 1 1 0 ↑T↑B 0x06 0 0 0 1 0 1 1 1 ↑T↑B↓FB 0x0F 0 0 0 1 1 0 0 0 ↑T 0x08 0 0 0 1 1 0 0 1 ↑T↑FB 0x0F 0 0 0 1 1 0 1 0 ↑T 0x08 0 0 0 1 1 0 1 1 ↑T↓FB 0x0F 0 0 0 1 1 1 0 0 ↑T↓B 0x0F 0 0 0 1 1 1 0 1 ↑T↓B↑FB 0x0F 0 0 0 1 1 1 1 0 ↑T↓B 0x0F 0 0 0 1 1 1 1 1 ↑T↓B↓FB 0x0F 0 0 1 0 0 0 0 0 Flat 0x0E 0 0 1 0 0 0 0 1 ↑FB 0x00 0 0 1 0 0 0 1 0 Flat 0x0E 0 0 1 0 0 0 1 1 ↓FB 0x01 0 0 1 0 0 1 0 0 ↑B 0x04 0 0 1 0 0 1 0 1 ↑B↑FB 0x02 0 0 1 0 0 1 1 0 ↑B 0x04 0 0 1 0 0 1 1 1 ↑B↓FB 0x0F 0 0 1 0 1 0 0 0 Flat 0x0E 0 0 1 0 1 0 0 1 ↑FB 0x00 0 0 1 0 1 0 1 0 Flat 0x0E 0 0 1 0 1 0 1 1 ↓FB 0x01 0 0 1 0 1 1 0 0 ↓B 0x05 0 0 1 0 1 1 0 1 ↓B↑FB 0x0F 0 0 1 0 1 1 1 0 ↓B 0x05 0 0 1 0 1 1 1 1 ↓B↓FB 0x03 0 0 1 1 0 0 0 0 ↓T 0x09 0 0 1 1 0 0 0 1 ↓T↑FB 0x0F 0 0 1 1 0 0 1 0 ↓T 0x09 0 0 1 1 0 0 1 1 ↓T↓FB 0x0F 0 0 1 1 0 1 0 0 ↓T↑B 0x0F 0 0 1 1 0 1 0 1 ↓T↑B↑FB 0x0F 0 0 1 1 0 1 1 0 ↓T↑B 0x0F 0 0 1 1 0 1 1 1 ↓T↑B↓FB 0x0F 0 0 1 1 1 0 0 0 ↓T 0x09 0 0 1 1 1 0 0 1 ↓T↑Fb 0x0F 0 0 1 1 1 0 1 0 ↓T 0x09 0 0 1 1 1 0 1 1 ↓T↓FB 0x0F 0 0 1 1 1 1 0 0 ↓T↓B 0x07 0 0 1 1 1 1 0 1 ↓T↓B↑FB 0x0F 0 0 1 1 1 1 1 0 ↓T↓B 0x07 0 0 1 1 1 1 1 1 ↓T↓B↓FB 0x0F 0 1 0 0 0 0 0 0 ↑FT 0x0C 0 1 0 0 0 0 0 1 ↑FT↑FB 0x0F 0 1 0 0 0 0 1 0 ↑FT 0x0C 0 1 0 0 0 0 1 1 ↑FT↓FB 0x0F 0 1 0 0 0 1 0 0 ↑FT↑B 0x0F 0 1 0 0 0 1 0 1 ↑FT↑B↑FB 0x0F 0 1 0 0 0 1 1 0 ↑FT↑B 0x0F 0 1 0 0 0 1 1 1 ↑FT↑B↓FB 0x0F 0 1 0 0 1 0 0 0 ↑FT 0x0C 0 1 0 0 1 0 0 1 ↑FT↑FB 0x0F 0 1 0 0 1 0 1 0 ↑FT 0x0C 0 1 0 0 1 0 1 1 ↑FT↓FB 0x0F 0 1 0 0 1 1 0 0 ↑FT↓B 0x0F 0 1 0 0 1 1 0 1 ↑FT↓B↑FB 0x0F 0 1 0 0 1 1 1 0 ↑FT↓B 0x0F 0 1 0 0 1 1 1 1 ↑FT↓B↓FB 0x0F 0 1 0 1 0 0 0 0 ↑FT↑T 0x0A 0 1 0 1 0 0 0 1 ↑FT↑T↑FB 0x0F 0 1 0 1 0 0 1 0 ↑FT↑T 0x0A 0 1 0 1 0 0 1 1 ↑FT↑T↓FB 0x0F 0 1 0 1 0 1 0 0 ↑FT↑T↑B 0x0F 0 1 0 1 0 1 0 1 ↑FT↑T↑TB↑FB 0x0F 0 1 0 1 0 1 1 0 ↑FT↑T↑B 0x0F 0 1 0 1 0 1 1 1 ↑↑FT↑T↑B↓FB 0x0F 0 1 0 1 1 0 0 0 ↑FT↑T 0x0A 0 1 0 1 1 0 0 1 ↑FT↑T↑FB 0x0F 0 1 0 1 1 0 1 0 ↑FT↑T 0x0A 0 1 0 1 1 0 1 1 ↑FT↑T↓FB 0x0F 0 1 0 1 1 1 0 0 ↑FT↑T↓B 0x0F 0 1 0 1 1 1 0 1 ↑FT↑T↓B↑FB 0x0F 0 1 0 1 1 1 1 0 ↑FT↑T↓B 0x0F 0 1 0 1 1 1 1 1 ↑FT↑T↓B↓FB 0x0F 0 1 1 0 0 0 0 0 ↑FT 0x0C 0 1 1 0 0 0 0 1 ↑FT↑FB 0x0F 0 1 1 0 0 0 1 0 ↑FT 0x0C 0 1 1 0 0 0 1 1 ↑FT↓FB 0x0F 0 1 0 0 1 0 0 ↑FT↑B 0x0F 0 1 1 0 0 1 0 1 ↑FT↑B↑FB 0x0F 0 1 1 0 0 1 1 0 ↑FT↑B 0x0F 0 1 1 0 0 1 1 1 ↑FT↑B↓FB 0x0F 0 1 1 0 1 0 0 0 ↑FT 0x0C 0 1 1 0 1 0 0 1 ↑FT↑FB 0x0F 0 1 1 0 1 0 1 0 ↑FT 0x0C 0 1 1 0 1 0 1 1 ↑FT↓FB 0x0F 0 1 1 0 1 1 0 0 ↑FT↓B 0x0F 0 1 1 0 1 1 0 1 ↑FT↓B↑FB 0x0F 0 1 1 0 1 1 1 0 ↑FT↓B 0x0F 0 1 1 0 1 1 1 1 ↑FT↓B↓FB 0x0F 0 1 1 1 0 0 0 0 ↑FT↓T 0x0F 0 1 1 1 0 0 0 1 ↑FT↓T↑FB 0x0F 0 1 1 1 0 0 1 0 ↑FT↓T 0x0F 0 1 1 1 0 0 1 1 ↑FT↓T↓FB 0x0F 0 1 1 1 0 1 0 0 ↑FT↓T↑B 0x0F 0 1 1 1 0 1 0 1 ↑FT↓T↑B↑FB 0x0F 0 1 1 1 0 1 1 0 ↑FT↓T↑B 0x0F 0 1 1 1 0 1 1 1 ↑FT↓T↑B↓FB 0x0F 0 1 1 1 1 0 0 0 ↑FT↓T 0x0F 0 1 1 1 1 0 0 1 ↑FT↓T↑FB 0x0F 0 1 1 1 1 0 1 0 ↑FT↓T 0x0F 0 1 1 1 1 0 1 1 ↑FT↓T↓FB 0x0F 0 1 1 1 1 1 0 0 ↑FT↓T↓B 0x0F 0 1 1 1 1 1 0 1 ↑FT↓T↓B↑FB 0x0F 0 1 1 1 1 1 1 0 ↑FT↓T↓B 0x0F 0 1 1 1 1 1 1 1 ↑FT↓T↓B↓FB 0x0F 1 0 0 0 0 0 0 0 Flat 0x0E 1 0 0 0 0 0 0 1 ↑FB 0x00 1 0 0 0 0 0 1 0 Flat 0x0E 1 0 0 0 0 0 1 1 ↓FB 0x01 1 0 0 0 0 1 0 0 ↑B 0x04 1 0 0 0 0 1 0 1 ↑B↑FB 0x02 1 0 0 0 0 1 1 0 ↑B 0x04 1 0 0 0 0 1 1 1 ↑B↓FB 0x0F 1 0 0 0 1 0 0 0 Flat 0x0E 1 0 0 0 1 0 0 1 ↑FB 0x00 1 0 0 0 1 0 1 0 Flat 0x0E 1 0 0 0 1 0 1 1 ↓FB 0x01 1 0 0 0 1 1 0 0 ↓B 0x05 1 0 0 0 1 1 0 1 ↓B↑FB 0x0F 1 0 0 0 1 1 1 0 ↓B 0x05 1 0 0 0 1 1 1 1 ↓B↓FB 0x03 1 0 0 1 0 0 0 0 ↑T 0x08 1 0 0 1 0 0 0 1 ↑T↑FB 0x0F 1 0 0 1 0 0 1 0 ↑T 0x08 1 0 0 1 0 0 1 1 ↑T↓FB 0x0F 1 0 0 1 0 1 0 0 ↑T↑B 0x06 1 0 0 1 0 1 0 1 ↑T↑B↑FB 0x0F 1 0 0 1 0 1 1 0 ↑T↑B 0x06 1 0 0 1 0 1 1 1 ↑T↑B↓FB 0x0F 1 0 0 1 1 0 0 0 ↑T 0x08 1 0 0 1 1 0 0 1 ↑T↑FB 0x0F 1 0 0 1 1 0 1 0 ↑T 0x08 1 0 0 1 1 0 1 1 ↑T↓FB 0x0F 1 0 0 1 1 1 0 0 ↑T↓B 0x0F 1 0 0 1 1 1 0 1 ↑T↓B↑FB 0x0F 1 0 0 1 1 1 1 0 ↑T↓B 0x0F 1 0 0 1 1 1 1 1 ↑T↓B↓FB 0x0F 1 0 1 0 0 0 0 0 Flat 0x0E 1 0 1 0 0 0 0 1 ↑FB 0x00 1 0 1 0 0 0 1 0 Flat 0x0E 1 0 1 0 0 0 1 1 ↓FB 0x01 1 0 1 0 0 1 0 0 ↑B 0x04 1 0 1 0 0 1 0 1 ↑B↑FB 0x02 1 0 1 0 0 1 1 0 ↑B 0x04 1 0 1 0 0 1 1 1 ↑B↓FB 0x0F 1 0 1 0 1 0 0 0 Flat 0x0E 1 0 1 0 1 0 0 1 ↑FB 0x00 1 0 1 0 1 0 1 0 Flat 0x0E 1 0 1 0 1 0 1 1 ↓FB 0x01 1 0 1 0 1 1 0 0 ↓B 0x05 1 0 1 0 1 1 0 1 ↓B↑FB 0x0F 1 0 1 0 1 1 1 0 ↓B 0x05 1 0 1 0 1 1 1 1 ↓B↓FB 0x03 1 0 1 1 0 0 0 0 ↓T 0x09 1 0 1 1 0 0 0 1 ↓T↑FB 0x0F 1 0 1 1 0 0 1 0 ↓T 0x09 1 0 1 1 0 0 1 1 ↓T↓FB 0x0F 1 0 1 1 0 1 0 0 ↓T↑B 0x0F 1 0 1 1 0 1 0 1 ↓T↑B↑FB 0x0F 1 0 1 1 0 1 1 0 ↓T↑B 0x0F 1 0 1 1 0 1 1 1 ↓T↑B↓FB 0x0F 1 0 1 1 1 0 0 0 ↓T 0x09 1 0 1 1 1 0 0 1 ↓T↑FB 0x0F 1 0 1 1 1 0 1 0 ↓T 0x09 1 0 1 1 1 0 1 1 ↓T↓FB 0x0F 1 0 1 1 1 1 0 0 ↓T↓B 0x07 1 0 1 1 1 1 0 1 ↓T↓B↑FB 0x0F 1 0 1 1 1 1 1 0 ↓T↓B 0x07 1 0 1 1 1 1 1 1 ↓T↓B↓FB 0x0F 1 1 0 0 0 0 0 0 ↓FT 0x0D 1 1 0 0 0 0 0 1 ↓FT↑FB 0x0F 1 1 0 0 0 0 1 0 ↓FT 0x0D 1 1 0 0 0 0 1 1 ↓FT↓FB 0x0F 1 1 0 0 0 1 0 0 ↓FT↑B 0x0F 1 1 0 0 0 1 0 1 ↓FT↑B↑FB 0x0F 1 1 0 0 0 1 1 0 ↓FT↑B 0x0F 1 1 0 0 0 1 1 1 ↓FT↑B↓FB 0x0F 1 1 0 0 1 0 0 0 ↓FT 0x0D 1 1 0 0 1 0 0 1 ↓FT↑FB 0x0F 1 1 0 0 1 0 1 0 ↓FT 0x0D 1 1 0 0 1 0 1 1 ↓FT↓FB 0x0F 1 1 0 0 1 1 0 0 ↓FT↓B 0x0F 1 1 0 0 1 1 0 1 ↓FT↓B↑FB 0x0F 1 1 0 0 1 1 1 0 ↓FT↓B 0x0F 1 1 0 0 1 1 1 1 ↓FT↓B↓FB 0x0F 1 1 0 1 0 0 0 0 ↓FT↑T 0x0F 1 1 0 1 0 0 0 1 ↓FT↑T↑FB 0x0F 1 1 0 1 0 0 1 0 ↓FT↑T 0x0F 1 1 0 1 0 0 1 1 ↓FT↑T↓FB 0x0F 1 1 0 1 0 1 0 0 ↓FT↑T↑B 0x0F 1 1 0 1 0 1 0 1 ↓FT↑T↑B↑FB 0x0F 1 1 0 1 0 1 1 0 ↓FT↑T↑B 0x0F 1 1 0 1 0 1 1 1 ↓FT↑T↑B↓FB 0x0F 1 1 0 1 1 0 0 0 ↓FT↑T 0x0F 1 1 0 1 1 0 0 1 ↓FT↑T↑FB 0x0F 1 1 0 1 1 0 1 0 ↓FT↑T 0x0F 1 1 0 1 1 0 1 1 ↓FT↑T↓FB 0x0F 1 1 0 1 1 1 0 0 ↓FT↑T↓B 0x0F 1 1 0 1 1 1 0 1 ↓FT↑T↓B↑FB 0x0F 1 1 0 1 1 1 1 0 ↓FT↑T↓B 0x0F 1 1 0 1 1 1 1 1 ↓FT↑T↓B↓FB 0x0F 1 1 1 0 0 0 0 0 ↓FT 0x0D 1 1 1 0 0 0 0 1 ↓FT↑FB 0x0F 1 1 1 0 0 0 1 0 ↓FT 0x0D 1 1 1 0 0 0 1 1 ↓FT↓FB 0x0F 1 1 1 0 0 1 0 0 ↓FT↑B 0x0F 1 1 1 0 0 1 0 1 ↓FT↑B↑FB 0x0F 1 1 1 0 0 1 1 0 ↓FT↑B 0x0F 1 1 1 0 0 1 1 1 ↓FT↑B↓FB 0x0F 1 1 1 0 1 0 0 0 ↓FT 0x0D 1 1 1 0 1 0 0 1 ↓FT↑FB 0x0F 1 1 1 0 1 0 1 0 ↓FT 0x0D 1 1 1 0 1 0 1 1 ↓FT↓FB 0x0F 1 1 1 0 1 1 0 0 ↓FT↓B 0x0F 1 1 1 0 1 1 0 1 ↓FT↓B↑FB 0x0F 1 1 1 0 1 1 1 0 ↓FT↓B 0x0F 1 1 1 0 1 1 1 1 ↓FT↓B↓FB 0x0F 1 1 1 1 0 0 0 0 ↓FT↓T 0x0B 1 1 1 1 0 0 0 1 ↓FT↓T↑FB 0x0F 1 1 1 1 0 0 1 0 ↓FT↓T 0x0B 1 1 1 1 0 0 1 1 ↓FT↓T↓FB 0x0F 1 1 1 1 0 1 0 0 ↓FT↓T↑B 0x0F 1 1 1 1 0 1 0 1 ↓FT↓T↑B↑FB 0x0F 1 1 1 1 0 1 1 0 ↓FT↓T↑B 0x0F 1 1 1 1 0 1 1 1 ↓FT↓T↑B↓FB 0x0F 1 1 1 1 1 0 0 0 ↓FT↓T 0x0B 1 1 1 1 1 0 0 1 ↓FT↓T↑FB 0x0F 1 1 1 1 1 0 1 0 ↓FT↓T 0x0B 1 1 1 1 1 0 1 1 ↓FT↓T↓FB 0x0F 1 1 1 1 1 1 0 0 ↓FT↓T↓B 0x0F 1 1 1 1 1 1 0 1 ↓FT↓T↓B↑FB 0x0F 1 1 1 1 1 1 1 0 ↓FT↓T↓B 0x0F 1 1 1 1 1 1 1 1 ↓FT↓T↓B↓FB 0x0F

TABLE 2 Notation used in Table 1. Notation Meaning FT Far Top, indicates a significant edge between rows 0 and 1 T Top, indicates a significant edge between row 1 and 2 B Bottom, indicates a significant edge between rows 2 and 3 FB Far Bottom, indicates a significant edge between rows 3 and 4 ↑ indicates edge slope increases in the direction of increasing row number ↓ indicates edge slope decreases in the direction of increasing row number Flat Flat, indicates absence of a significant edge

To understand the codes used in the table consider the following examples. The edge state description ↑B↑FB having code 0x02 refers to a significant increasing-value edge between rows 2 and 3 and a significant increasing-value edge between rows 3 and 4. ↑T↓B↓FB having code 0x00 refers to a significant increasing edge between rows 1 and 2, a significant decreasing edge between rows 2 and 3, and a significant decreasing edge between rows 3 and 4. Since each of FT, T, B, and FB can be in one of 3 states in this table (increasing, decreasing, not significant), 81 states are possible requiring 7 bits of coding. Practically, not all of these states are important to real edge-identification applications. It has been found that 4 to 6 bits can encode the useful states for most applications. Table 1 provides a 4-bit example.

As stated above, more than one orientation of vectors is employed for corner identification, and the multiple orientation edge-state codes can be mapped at block 655 through an encoding process to produce a corner-state code. Consider an example where we wish to indicate that a corner covers pixels p₃₃, p₃₄, p₄₃, p₄₄, and the edge identification processor is employing horizontal vectors (rows) and vertical vectors (columns). The definition of the vertical edge states are analogous to the horizontal states, with FL (Far Left), L (Left), Right (Right), FR (Far Right) being analogous to FT, T, B, FB respectively. A corner covering p₃₃, p₃₄, p₄₃, p₄₄, would result in the codes for ↑B (0x04) and ↑R (0x04), from the row-edge encoding table and the column edge-encoding table, respectively. When these two codes are received by an encoder for multiple orientations, a code would be generated for the p₃₃-p₃₄-p₄₃-p₄₄-type corner. An example of a table for encoding an overall corner state from orientation edge states is given below in Table 3. In this example, the table converts 4 bits from the horizontal codes and 4 bits from the vertical codes to 8 bits for an overall corner state code.

TABLE 3 An example of a table encoding an overall edge state from orientation edge states. Concatenation of Orientation Edge State Code Overall Edge State Code 0x00 0x00 0x01 0x01 0x02 0x02 0x03 0x03 0x04 0x04 0x05 0x05 0x06 0x06 0x07 0x07 0x08 0x08 0x09 0x09 0x0A 0x0A 0x0B 0x0B 0x0C 0x0C 0x0D 0x0D 0x0E 0xEE 0x0F 0xEE 0x10 0x10 0x11 0x11 0x12 0x12 0x13 0x13 0x14 0x14 0x15 0x15 0x16 0x16 0x17 0x17 0x18 0x18 0x19 0x19 0x1A 0x1A 0x1B 0x1B 0x1C 0x1C 0x1D 0x1D 0x1E 0xEE 0x1F 0xEE 0x20 0x20 0x21 0x21 0x22 0x22 0x23 0x23 0x24 0x24 0x25 0x25 0x26 0x26 0x27 0x27 0x28 0x28 0x29 0x29 0x2A 0x2A 0x2B 0x2B 0x2C 0x2C 0x2D 0x2D 0x2E 0xEE 0x2F 0xEE 0x30 0x30 0x31 0x31 0x32 0x32 0x33 0x33 0x34 0x34 0x35 0x35 0x36 0x36 0x37 0x37 0x38 0x38 0x39 0x39 0x3A 0x3A 0x3B 0x3B 0x3C 0x3C 0x3D 0x3D 0x3E 0xEE 0x3F 0xEE 0x40 0x40 0x41 0x41 0x42 0x42 0x43 0x43 0x44 0x44 0x45 0x45 0x46 0x46 0x47 0x47 0x48 0x48 0x49 0x49 0x4A 0x4A 0x4B 0x4B 0x4C 0x4C 0x4D 0x4D 0x4E 0xEE 0x4F 0xEE 0x50 0x50 0x51 0x51 0x52 0x52 0x53 0x53 0x54 0x54 0x55 0x55 0x56 0x56 0x57 0x57 0x58 0x58 0x59 0x59 0x5A 0x5A 0x5B 0x5B 0x5C 0x5C 0x5D 0x5D 0x5E 0xEE 0x5F 0xEE 0x60 0x60 0x61 0x61 0x62 0x62 0x63 0x63 0x64 0x64 0x65 0x65 0x66 0x66 0x67 0x67 0x68 0x68 0x69 0x69 0x6A 0x6A 0x6B 0x6B 0x6C 0x6C 0x6D 0x6D 0x6E 0xEE 0x6F 0xEE 0x70 0x70 0x71 0x71 0x72 0x72 0x73 0x73 0x74 0x74 0x75 0x75 0x76 0x76 0x77 0x77 0x78 0x78 0x79 0x79 0x7A 0x7A 0x7B 0x7B 0x7C 0x7C 0x7D 0x7D 0x7E 0xEE 0x7F 0xEE 0x80 0x80 0x81 0x81 0x82 0x82 0x83 0x83 0x84 0x84 0x85 0x85 0x86 0x86 0x87 0x87 0x88 0x88 0x89 0x89 0x8A 0x8A 0x8B 0x8B 0x8C 0x8C 0x8D 0x8D 0x8E 0xEE 0x8F 0xEE 0x90 0x90 0x91 0x91 0x92 0x92 0x93 0x93 0x94 0x94 0x95 0x95 0x96 0x96 0x97 0x97 0x98 0x98 0x99 0x99 0x9A 0x9A 0x9B 0x9B 0x9C 0x9C 0x9D 0x9D 0x9E 0xEE 0x9F 0xEE 0xA0 0xA0 0xA1 0xA1 0xA2 0xA2 0xA3 0xA3 0xA4 0xA4 0xA5 0xA5 0xA6 0xA6 0xA7 0xA7 0xA8 0xA8 0xA9 0xA9 0xAA 0xAA 0xAB 0xAB 0xAC 0xAC 0xAD 0xAD 0xAE 0xEE 0xAF 0xEE 0xB0 0xB0 0xB1 0xB1 0xB2 0xB2 0xB3 0xB3 0xB4 0xB4 0xB5 0xB5 0xB6 0xB6 0xB7 0xB7 0xB8 0xB8 0xB9 0xB9 0xBA 0xBA 0xBB 0xBB 0xBC 0xBC 0xBD 0xBD 0xBE 0xEE 0xBF 0xEE 0xC0 0xC0 0xC1 0xC1 0xC2 0xC2 0xC3 0xC3 0xC4 0xC4 0xC5 0xC5 0xC6 0xC6 0xC7 0xC7 0xC8 0xC8 0xC9 0xC9 0xCA 0xCA 0xCB 0xCB 0xCC 0xCC 0xCD 0xCD 0xCE 0xEE 0xCF 0xEE 0xD0 0xD0 0xD1 0xD1 0xD2 0xD2 0xD3 0xD3 0xD4 0xD4 0xD5 0xD5 0xD6 0xD6 0xD7 0xD7 0xD8 0xD8 0xD9 0xD9 0xDA 0xDA 0xDB 0xDB 0xDC 0xDC 0xDD 0xDD 0xDE 0xEE 0xDF 0xEE 0xE0 0xEE 0xE1 0xEE 0xE2 0xEE 0xE3 0xEE 0xE4 0xEE 0xE5 0xEE 0xE6 0xEE 0xE7 0xEE 0xE8 0xEE 0xE9 0xEE 0xEA 0xEE 0xEB 0xEE 0xEC 0xEE 0xED 0xEE 0xEE 0xEE 0xEF 0xEE 0xF0 0xEE 0xF1 0xEE 0xF2 0xEE 0xF3 0xEE 0xF4 0xEE 0xF5 0xEE 0xF6 0xEE 0xF7 0xEE 0xF8 0xEE 0xF9 0xEE 0xFA 0xEE 0xFB 0xEE 0xFC 0xEE 0xFD 0xEE 0xFE 0xEE 0xFF 0xEE

FIG. 7 shows an example digital image 700 and a resultant image plane of codes 720 as produced by an edge identification process 710 as diagrammatically illustrated in FIG. 6. The image 700 is a square of pixels each possessing a value of 255 within a field of pixels each possessing a value of 0. The image is input to the corner identification process 710 to produce corner identification codes, each shown in hexadecimal form in the image plane of codes 720. As can be seen in the example, the codes 720 differentiate positions about a corner. This edge information can be used to extend the corner, thereby producing a sharpening effect.

An example illustrating the sharpening of outside corners at locations indicated by the corner identification codes is shown in FIG. 8. Starting with normal bitmap 1100, printed image 1110 shows how the corners get undesirably rounded off when printed. The sharpened bitmap 1120 depicts bitmap 1100 after application of the presently described embodiment. High addressability pixels are used in this example. Each corner of sharpened bitmap 1120 has been sharpened. This yields an enhanced printed image 1130 which has the original intended appearance of normal bitmap 1100. The example depicted in FIG. 8 shows right angle corners oriented normally on the page. It will be apparent to one skilled in the art that the disclosure applies to corner structure, serifs, and fine terminating points of all orientations, positions, and angles. Within the present application, we collectively refer to these image structures as corners or corner structure.

While the example given above addresses sharpening of outside corners, it is readily apparent to one skilled in the art that the same techniques may be applied to sharpening inside corners to achieve an ink trap as is depicted in FIG. 11.

Additional information may be used to guide the corner sharpening process. For instance a data type indicator, or tag, may indicate that an image object is text, thereby requiring corner sharpening. Other tags could disable the sharpening operation. That is, the use of corner sharpening could be “tag driven” or the corner sharpening could be applied to a tag plane to generate output signals, where a window of tags would be applied to the corner sharpening operation to generate an output tag plane with sharpened corners of tag image data.

The claims, as originally presented and as they may be amended, encompass variations, alternatives, modifications, improvements, equivalents, and substantial equivalents of the embodiments and teachings disclosed herein, including those that are presently unforeseen or unappreciated, and that, for example, may arise from applicants/patentees and others. 

1. A method of corner sharpening in the display of a bitmapped digital image, comprising: a) selecting a target pixel location within the digital image; b) observing a set of pixels within a pixel observation window superimposed on the digital image, relative to the target pixel location; c) generating edge-state codes for a plurality of pairs of neighboring vectors of pixels within the pixel observation window; d) generating a corner-identification code from the plurality of edge-state codes using at least one look-up table; and, e) assigning a pixel value in an output image plane in a location corresponding to the target pixel in the input image, such that that assigned value extends a corner where so indicated by the corner identification code, thereby producing a corner sharpening effect for the digital image.
 2. The method of claim 1, wherein the corner-identification codes indicate at least one of the following: the presence of an inside corner; the presence of an outside corner; and the absence of a corner.
 3. The method of claim 2, wherein the generation of the edge-state codes comprises: a) generating a sum of weighted pixel values, for each of the vectors of pixels of the plurality of pairs of neighboring pixels that run through the pixel observation window; b) generating sum-to-sum differences for the neighboring pairs of vectors; and, c) encoding the edge-state for each pair of the neighboring vectors of pixels by using one or more bits to encode a magnitude and one bit to encode a sign of the sum-to-sum differences.
 4. The method of claim 3 wherein the assigned pixel values have an increased grayscale value over the input image target pixel value.
 5. The method of claim 3 wherein the assigned pixel values have a decreased grayscale value over the input image target pixel value.
 6. The method of claim 3 wherein the plurality of vectors are aligned at a plurality of orientations.
 7. The method of claim 6 wherein the plurality of orientations is taken from vertical, horizontal, diagonal left, diagonal right.
 8. The method of claim 6 wherein each orientation of the plurality of orientations is used to generate an orientated-edge-identification code, and the bits forming the orientated-edge-identification codes are used to form an address into a look-up table that points to the corner identification code.
 9. The method of claim 2 wherein the assigned a pixel value is in the form of one of a binary pixel, a continuous tone pixel, a high addressable pixel.
 10. A method for producing corner sharpened image data from binary digital image data comprising: a) observing a set of pixels about a target pixel within a pixel observation window superimposed on the binary digital image, relative to the target pixel location; b) generating sums of weighted pixel values, where the sums are taken over at least first-orientation vectors and second-orientation vectors of pixels that run through the observation window; c) generating sum-to-sum differences for neighboring pairs of said first-orientation vectors of pixels and second-orientation vectors of pixels; d) generating edge-state codes for each pair of the neighboring first-orientation vectors of pixels and second-orientation vectors of pixels by using one or more bits to encode a magnitude and one bit to encode a sign; e) generating a first-orientation edge identification code and second-orientation edge identification code by using a plurality of said respectively oriented encoded edge-state codes, where the bits of the edge-state codes are combined to form an index that addresses a respective orientation look-up table that maps multiple encoded edge states to the respective orientation edge identification codes; f) generating an overall corner identification code by using the orientation edge identification codes for the at least two orientations of vectors, wherein the bits that form the corner identification codes for the at least two orientations of vectors are combined to form an index that is used to address an overall corner identification look-up table; and, g) assigning a pixel value in an output image plane in a location corresponding to the target pixel in the input image, such that that assigned value extends a corner where so indicated by the overall corner identification code, thereby producing a corner sharpening effect for the image data.
 11. The method of claim 10, wherein the first orientation is one of vertical, horizontal, diagonal left, and diagonal right.
 12. The method of claim 10, wherein the corner identification indicates one of either the presence of an inside corner, the presence of an outside corner, or the absence of a corner within the observation window.
 13. A method for producing corner sharpened image data from continuous tone digital image data comprising: a) selecting a target pixel location within the continuous tone image; b) observing a set of pixels within a pixel observation window superimposed on the continuous tone image, relative to the target pixel location; c) generating edge-state codes for a plurality of pairs of neighboring vectors of pixels within the pixel observation window; d) generating a corner-identification code from the plurality of edge-state codes using at least one look-up table so as to thereby identify corner pixels; and, e) assigning a pixel value in an output image plane in a location corresponding to the target pixel in the input image, such that that assigned value extends a corner where indicated by the corner-identification code, thereby producing a corner sharpening effect.
 14. The method of claim 13, wherein the corner-identification codes indicate at least one of the following: the presence of an inside corner; the presence of an outside corner; and the absence of a corner.
 15. The method of claim 14, wherein the generation of the edge-state codes comprises: a) generating a sum of weighted pixel values, for each of the vectors of pixels that run through the pixel observation window; b) generating sum-to-sum differences for the neighboring pairs of vectors; and, c) encoding the edge-state for each pair of the neighboring vectors of pixels by using one or more bits to encode a magnitude and one bit to encode a sign of the sum-to-sum differences.
 16. The method of claim 15 wherein the assigned pixel values have an increased grayscale value over the input image target pixel value.
 17. The method of claim 15 wherein the assigned pixel values have a decreased grayscale value over the input image target pixel value.
 18. The method of claim 15 wherein the plurality of vectors are aligned at a plurality of orientations.
 19. The method of claim 18 wherein the plurality of orientations is taken from vertical, horizontal, diagonal left, diagonal right.
 20. The method of claim 18 wherein each orientation of the plurality of orientations is used to generate an orientated-edge-identification code, and the bits forming the orientated-edge-identification codes are used to form an address into a look-up table that points to the corner identification code.
 21. The method of claim 14 wherein the assigned a pixel value is in the form of one of a binary pixel, a continuous tone pixel, a high addressable pixel. 